Cooperative Allocation and Guidance for Air Defence Application

نویسندگان

  • S. Le Ménec
  • K. Markham
  • A. Tsourdos
  • H.-S. Shin
  • H. Piet-Lahanier
چکیده

This project proposes a centralized algorithm to design cooperative allocation strategies and guidance laws for air defense applications. Scenarios in naval and ground context have been defined for performance analysis by comparison to a benchmark target allocation policy. The cooperative target allocation algorithm is based on the following features: No Escape Zones (differential game NEZ) computation to characterize the defending missile capturability characteristics; In Flight (re) Allocation (IFA algorithm, late committal guidance) capability to deal with target priority management and pop up threats; capability to generate and counter alternative target assumptions based on concurrent beliefs of future target behaviors, i.e. Salvo Enhanced No Escape Zone (SENEZ) algorithm. The target trajectory generation has been performed using goal oriented trajectory extrapolation techniques. The target allocation procedure is based on minimax strategy computation in matrix games.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Midcourse Trajectory Shaping for Air and Ballistic Defence Guidance Using Bezier Curves

A near-optimal midcourse trajectory shaping guidance algorithm is proposed for both air and ballistic target engagement mission attributes for generic long range interceptor missile. This guidance methodology is based on the maximum final velocity as the objective function and maximum permissible flight altitude as the in-flight state constraint as well as the head-on orientation as the termina...

متن کامل

A Closed-Form Formula for the Fair Allocation of Gains in Cooperative N-Person Games

Abstract   This paper provides a closed-form optimal solution to the multi-objective model of the fair allocation of gains obtained by cooperation among all players. The optimality of the proposed solution is first proved. Then, the properties of the proposed solution are investigated. At the end, a numerical example in inventory control environment is given to demonstrate the application and t...

متن کامل

General form of a cooperative gradual maximal covering location problem

Cooperative and gradual covering are two new methods for developing covering location models. In this paper, a cooperative maximal covering location–allocation model is developed (CMCLAP). In addition, both cooperative and gradual covering concepts are applied to the maximal covering location simultaneously (CGMCLP). Then, we develop an integrated form of a cooperative gradual maximal covering ...

متن کامل

Power Allocation In Cooperative Relay Channels

This paper concerns power allocation in relay-assisted wireless channels for two-hop transmission. First, the transmitter sends the information to both the relay and receiver parts. Next, in the second hop, the transmitter cooperates with the relay to increase the received signal to noise ratio (SNR), assuming the relay makes use of the Amplify and Forward (AF) strategy. Moreover, it is assumed...

متن کامل

Optimal Power Management to Minimize SER in Amplify and-Forward Relay Networks

This paper studies optimal power allocation to minimize symbol error rate (SER) of amplify-and-forward cooperative diversity networks. First, we analytically solve optimal power allocation problem to minimize SER for three different scenarios, namely, multi-branch single-relay, single-branch multi-relay and multi-branch multi-relay cooperative diversity networks, all subject to a given total re...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011